-
1 combinatorial theorem
Большой англо-русский и русско-английский словарь > combinatorial theorem
-
2 combinatorial theorem
Математика: комбинаторная теорема -
3 combinatorial theorem
English-Russian scientific dictionary > combinatorial theorem
-
4 theorem
- analytical hierarchy theorem - arithmetical hierarchy theorem - closed range theorem - formally provable theorem - implicit function theorem - initial value theorem - integral representation theorem - local limit theorem - maximal ergodic theorem - mean value theorem - normal form theorem - ratio limit theorem - rational root theorem - second mean value theorem - theorem of consistency proofs - theorem of corresponding states - three line theorem - three series theorem - uniform convergence theorem - uniform ergodic theorem - uniform mean value theoremtheorem implies — из теоремы следует, что…
-
5 integral
nounинтеграл mpath integral функциональный/континуальный интеграл, интеграл по траекториямstochastic integral with respect to a martingale стохастический интеграл по мар- тингалуstochastic integral with respect to a martingale measure стохастический интеграл по мартингальной мереstochastic integral with respect to a random measure стохастический интеграл по случайной мереstochastic integral with respect to a semi-martingale стохастический интеграл по семимартингалуsymmetric stochastic integral симметрический стохастический интеграл, интеграл СтратоновичаАнглийский-русский словарь по теории вероятностей, статистике и комбинаторике > integral
-
6 proof
1) доказательство; обоснование; подтверждение2) полигр. корректура, пробный оттиск4) проверка; испытание; проба || проверять; испытывать; опробовать5) безопасный; защищённый6) обеспечивать непроницаемость; герметизировать•proof against — устойчивый к воздействию (какого-л. фактора)
proof by contradiction — мат. доказательство от противного
proof by induction — мат. доказательство по индукции
proof by matrices — мат. доказательство с помощью матриц
proof in outline — набросок [схема] доказательства;
this completes the proof — это завершает доказательство; на этом доказательство заканчивается
- strong proofto give a proof — матем. дать доказательство
-
7 scheme
1) схема || составлять схему2) план; замысел || планировать, замышлять•- composite sampling scheme - decisive scheme - double sampling scheme - singly connected scheme -
8 system
1) система; комплекс2) совокупность•- absolutely consistent system - absolutely direct indecomposable system - absolutely free system - absolutely irreducible system - absolutely isolated system - allowable coordinate system - almost linear system - ample linear system - artificial feel system - automatic block system - automatic deicing system - binary relational system - binary-coded decimal system - block tooling system - Cartesian coordinate system - completely controllable system - completely ergodic system - completely hyperbolic system - completely identifiable system - completely integrable system - completely irreducible system - completely regular system - completely stable system - completely stratified system - complex number system - conical coordinate system - derivational formal system - differential equation system - differential selsyn system - digital counting system - digital transmission system - elliptic coordinate system - elliptic cylindrical coordinate system - externally inconsistent system - finite state system - finitely axiomatizable system - finitely presented system - fully characteristic quotient system - fundamental system of solutions - hydraulic lift system - integrated switching system - isomorphically embedded system - kernel normal system - linearly dependent system - linearly independent system - live hydraulic system - locking protection system - meteor-burst communication system - modular programming system - parabolic cylindrical coordinate system - permanent four-wheel drive system - pure independent system - radio telephone system - reactor protection system - real number system - receiver-amplifier crioelectric system - remote-cylinder hydraulic system - semantically consistent system - simply consistent system - simply incomplete system - simply ordered system - spherical coordinate system - strongly multiplicative system - structurally stable system - sufficiently general coordinate system - system of frequency curves - system of rational numbers - time multiplex system - time-division multiplex system - uniformly complete system - univalent system of notation - universal system of notation - weakly closed system - weighted number system
См. также в других словарях:
Combinatorial design — theory is the part of combinatorial mathematics that deals with the existence and construction of systems of finite sets whose intersections have specified numerical properties. For instance, a balanced incomplete block design (usually called for … Wikipedia
Combinatorial commutative algebra — is a relatively new, rapidly developing mathematical discipline. As the name implies, it lies at the intersection of two more established fields, commutative algebra and combinatorics, and frequently uses methods of one to address problems… … Wikipedia
Combinatorial game theory — This article is about the theory of combinatorial games. For the theory that includes games of chance and games of imperfect knowledge, see Game theory. Mathematicians playing Konane at a Combinatorial game theory workshop (for technical content … Wikipedia
Combinatorial topology — In mathematics, combinatorial topology was an older name for algebraic topology, dating from the time when topological invariants of spaces (for example the Betti numbers) were regarded as derived from combinatorial decompositions such as… … Wikipedia
Combinatorial map — A combinatorial map is a combinatorial object modelling topological structures with subdivided objects. Historically, the concept was introduced informally by J. Edmonds for polyhedral surfaces [1] which are planar graphs. It was given its first… … Wikipedia
Combinatorial proof — In mathematics, the term combinatorial proof is often used to mean either of two types of proof of an identity in enumerative combinatorics that either states that two sets of combinatorial configurations, depending on one or more parameters,… … Wikipedia
Kruskal–Katona theorem — The Kruskal ndash;Katona theorem is a combinatorial theorem about uniform hypergraphs. It can be used to derive facts about abstract simplicial complexes. It is named for Joseph Kruskal and Gyula O. H. Katona.For an n element set X , define the… … Wikipedia
Hales–Jewett theorem — In mathematics, the Hales–Jewett theorem is a fundamental combinatorial result of Ramsey theory, concerning the degree to which high dimensional objects must necessarily exhibit some combinatorial structure; it is impossible for such objects to… … Wikipedia
Binomial theorem — The binomial coefficients appear as the entries of Pascal s triangle. In elementary algebra, the binomial theorem describes the algebraic expansion of powers of a binomial. According to the theorem, it is possible to expand the power… … Wikipedia
Fundamental theorem of combinatorial enumeration — The fundamental theorem of combinatorial enumeration is a theorem in combinatorics that solves the enumeration problem of labelled and unlabelled combinatorial classes. The unlabelled case is based on the Pólya enumeration theorem.This theorem is … Wikipedia
Max-flow min-cut theorem — In optimization theory, the max flow min cut theorem states that in a flow network, the maximum amount of flow passing from the source to the sink is equal to the minimum capacity which when removed in a specific way from the network causes the… … Wikipedia